Characterizing Braess’s Paradox for Traffic Networks
نویسندگان
چکیده
We generalize Braess’s paradoxical example by defining a Braess Paradox to occur when the Wardrop equilibrium distribution of traffic flows is not strongly Pareto optimal. We characterize a Braess Paradox in terms of the solution to a mathematical program. Examples illustrate unexpected properties of these solutions. We discuss a computational approach to detecting a Braess Paradox. Keywords— Multicommodity Traffic, Noncooperative Equilibrium, Nonlinear Programming, Braess Paradox.
منابع مشابه
Road Network Optimization for Increasing Traffic Flow
In the traffic flow on the city road network, it is observed that a new additional road, which is constructed for overcoming the traffic jam, causes more terrible traffic jam. This is well known as Braess’s paradox. Recently, it is pointed out that Braess’s paradox depends on the traffic density and the paradox disappears at high traffic density. The aim of this study is to describe the algorit...
متن کاملOn Braess’s Paradox
In 1968, Braess [1] demonstrated a remarkable and counterintuitive fact, now known as “Braess’s Paradox”: in a network in which users selfishly and independently choose minimum-latency paths and the latency of an edge increases with the amount of edge congestion, deleting edges from the network can decrease the latency encountered by traffic. Our work here is primarily motivated by the paper of...
متن کاملStronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
We give several new upper and lower bounds on the worst-case severity of Braess’s paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In single-commodity networks with arbitrary continuous and nondecreasing latency functions, we prove that this worst-case price of anarchy is exactly n − 1, where n is the number of network vertices. For Braess’s par...
متن کاملBraess's Paradox in Large Sparse Graphs
Braess’s paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of distributed (selfish) routing situations understanding this paradox has become an important concern in a broad range of network design situations. However, the previous theoretical work on Braess’s paradox has focused on “d...
متن کاملBraess's paradox in expanders
Expander graphs are known to facilitate effective routing and most real-world networks have expansion properties. At the other extreme, it has been shown that in some special graphs, removing certain edges can lead to more efficient routing. This phenomenon is known as Braess’s paradox and is usually regarded as a rare event. In contrast to what one might expect, we show that Braess’s paradox i...
متن کامل